Delaying Mismatched Field Multiplications in Pairing Computations
نویسندگان
چکیده
Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full extension field Fpk are multiplied by elements contained in proper subfields Fpk/d , and by elements in the base field Fp. We show that significant speedups in pairing computations can be achieved by delaying these “mismatched” multiplications for an optimal number of iterations. Importantly, we show that our technique can be easily integrated into traditional pairing algorithms; implementers can exploit the computational savings herein by applying only minor changes to existing pairing code.
منابع مشابه
Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
In recent years there has been much interest in the development and the fast computation of bilinear pairings due to their practical and myriad applications in cryptography. Well known efficient examples are the Weil and Tate pairings and their variants such as the Eta and Ate pairings on the Jacobians of (hyper-)elliptic curves. In this paper, we consider the use of projective coordinates for ...
متن کاملSpeeding Up Ate Pairing Computation in Affine Coordinates
At Pairing 2010, Lauter et al’s analysis showed that Ate pairing computation in affine coordinates may be much faster than projective coordinates at high security levels. In this paper, we further investigate techniques to speed up Ate pairing computation in affine coordinates. On the one hand, we improve Ate pairing computation over elliptic curves admitting an even twist by describing an 4-ar...
متن کاملSelf-pairings on supersingular elliptic curves with embedding degree three
Self-pairings are a special subclass of pairings and have interesting applications in cryptographic schemes and protocols. In this paper, we explore the computation of the self-pairings on supersingular elliptic curves with embedding degree k = 3. We construct a novel self-pairing which has the same Miller loop as the Eta/Ate pairing. However, the proposed self-pairing has a simple final expone...
متن کاملEfficient multiplication in characteristic three fields
Characteristic three fields denoted by F3n , where n ≥ 1, are used in curve based cryptography. In this paper, first we improve the well known Karatsuba 2-way and 3-way algorithms for characteristic three fields. Then, we derive a 3-way polynomial multiplication algorithm with five 1/3 size multiplications using interpolation in F9. After computing the arithmetic and delay complexities of the p...
متن کاملEfficient GF (3) Multiplication Algorithm for ηT Pairing
The computation speed of pairing based cryptosystems is slow compared with the other public key cryptosystems even though several efficient computation algorithms have been proposed. Thus more efficient computation of the Tate pairing is an important research goal. GF (3) multiplication in GF (3) in the pairing algorithm is the greatest consumer of time. Past research concentrated on reducing t...
متن کامل